NARROWING STRATEGIES FOR ARBITRARY CANONICAL REWRITE SYSTEMS
نویسندگان
چکیده
منابع مشابه
Narrowing Strategies for Arbitrary Canonical Rewrite Systems
Narrowing is a universal unification procedure for equational theories defined by a canonical term rewriting system. In its original form it is extremely inefficient. Therefore, many optimizations have been proposed during the last years. In this paper, we present the narrowing strategies for arbitrary canonical systems in a uniform framework and introduce the new narrowing strategy LSE narrowi...
متن کاملCanonical Conditional Rewrite Systems
Conditional equations have been studied for their use in the specification of abstract data types and as a computational paradigm that combines logic and function programming in a clean way. In this paper we examine different formulations of conditional equations as rewrite systems, compare their expressive power and give sufficient conditions for rewrite systems to have the "confluence" proper...
متن کاملCompleteness of Narrowing for Orthogonal Conditional Rewrite Systems
Conditional narrowing is underlying computational mechanism of most functional-logic programming languages. It is important to ensure completeness of conditional narrowing for conditional term rewriting systems without assumption of termination because termination is a too severe restriction for programming languages. In this paper we show completeness of conditional narrowing for a kind of ort...
متن کاملRefinements of Lazy Narrowing for Left-Linear Fully-Extended Pattern Rewrite Systems
Lazy narrowing is a general E-unification procedure for equational theories presented by confluent term rewriting systems. It has been deeply studied in the first order case and various higher-order extensions have been proposed in an attempt to improve its expressive power. Such extensions suffer from huge search space in guessing the solutions of variables of functional type. For practical pu...
متن کاملRewrite Rules and Strategies for Molecular Graphs
In this paper, we present a rewriting framework for modeling molecular complexes, biochemical reaction rules and generation of biochemical networks based on the representation of molecular complexes as a particular type of multigraphs with ports called molecular graphs. The advantage of this approach is to obtain for free a rewriting calculus which allows defining at the same level transformati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 1995
ISSN: 0169-2968
DOI: 10.3233/fi-1995-24126